Computable error bounds for an optimization problem with parallelepiped constraint
نویسندگان
چکیده
منابع مشابه
A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملStability of error bounds for convex constraint
5 This paper studies stability of error bounds for convex constraint systems 6 in Banach spaces. We show that certain known sufficient conditions for local 7 and global error bounds actually ensure error bounds for the family of func8 tions being in a sense small perturbations of the given one. A single inequality 9 as well as semi-infinite constraint systems are considered. 10 Mathematics Subj...
متن کاملComputable backward error bounds for basic algorithms in linear algebra
Standard error estimates in numerical linear algebra are often of the form γk|R||S| where R,S are known matrices and γk := ku/(1−u) with u denoting the relative rounding error unit. Recently we showed that for a number of standard problems γk can be replaced by ku for any order of computation and without restriction on the dimension. Such problems include LUand Cholesky decomposition, triangula...
متن کاملAn Intelligent Algorithm for Optimization of Resource Allocation Problem by Considering Human Error in an Emergency Department
Human error is a significant and ever-growing problem in the healthcare sector. In this study, resource allocation problem is considered along with human errors to optimize utilization of resources in an emergency department. The algorithm is composed of simulation, artificial neural network (ANN), design of experiment (DOE) and fuzzy data envelopment analysis (FDEA). It is a multi-response opt...
متن کاملAsynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing fast incomplete solution algorithms for large-scale applications. One of the few incomplete algorithms to provide bounds on solution quality is k-size optimality, which defines a local optimality criterion based on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1995
ISSN: 0377-0427
DOI: 10.1016/0377-0427(93)e0201-v